Uniform proofs as a foundation for logic programming
نویسندگان
چکیده
منابع مشابه
Uniform Proofs as a Foundation for Logic Programming
A proof-theoretic characterization of logical languages that form suitable bases for Prolog-like programming languages is provided. This characterization is based on the principle that the declarative meaning of a logic program, provided by provability in a logical system, should coincide with its operational meaning, provided by interpreting logical connectives as simple and fixed search instr...
متن کاملConcurrent Logic Programming as Uniform Linear Proofs
We describe a formalism based on the proof theory of linear logic, whose aim is to specify concurrent computations and whose language restriction (as compared to other linear logic languages) provides a simpler operational model that can lead to a more practical language core. The fragment is proved to be an abstract logic programming language, that is any sequent can be derived by uniform proo...
متن کاملSemantics of Concurrent Logic Programming as Uniform Proofs
We describe LC , a formalism based on the proof theory of linear logic, whose aim is to specify concurrent computations and whose language restriction (as compared to other linear logic language) provides a simpler operational model that can lead to a more practical language core. The LC fragment is proveded to be an abstract logic programming language, that is any sequent can be derived by uni...
متن کاملA Uniform Proof-theoretic Foundation for Abstract Paraconsistent Logic Programming
It is known that paraconsistent logic programming, which is usually based upon a paraconsistent logic, is important in dealing with inconsistency-tolerant and non-monotonic reasoning appropriately. Firstly in this paper, a cut-free single succedent sequent system SN4 and a cut-free multiple succedent sequent system MN4 are introduced for Nelson’s paraconsistent 4-valued logic N4 [3], and the un...
متن کاملUniform Proofs and Disjunctive Logic Programming (Extended Abstract)
One formulation of the concept of logic programming is the notion of Abstract Logic Programming Language, introduced in 8]. Central to that deeni-tion is uniform proof, which enforces the requirements of inference direction, including goal-directedness, and the duality of readings, declarative and procedural. We use this technology to investigate Disjunctive Logic Programming (DLP), an extensio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1991
ISSN: 0168-0072
DOI: 10.1016/0168-0072(91)90068-w